Two-closure of odd permutation group in polynomial time
نویسندگان
چکیده
منابع مشابه
The Cycle Polynomial of a Permutation Group
The cycle polynomial of a finite permutation group G is the generating function for the number of elements of G with a given number of cycles:
متن کاملRecognizing permutation functions in polynomial time
Let Fq be a finite field and f(x) ∈ Fq(x) be a rational function over Fq. The decision problem PermFunction consists of deciding whether f(x) induces a permutation on the elements of Fq. That is, we want to decide whether the corresponding map f : Fq 7→ Fq defined by a 7→ f(a) is a bijective mapping or not. This problem was known to be in ZPP but not known to be in P. We resolve the complexity ...
متن کاملPolar permutation graphs are polynomial-time recognisable
Polar graphs generalise bipartite graphs, cobipartite graphs, and split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete proble...
متن کاملPermutation Groups and Polynomial-Time Computation
Abstra t. We dis uss aspe ts of omputation in permutation groups assuming polynomial time as a measure of eÆ ien y. Of parti ular interest are problems, su h as nding the interse tion of two groups, that resemble or generalize the problem of testing graph isomorphism. We also summarize the instan es where the problems are known to be solvable in polynomial time and indi ate methods that a ompli...
متن کاملComputing the composition factors of a permutation group in polynomial time
Given generators for a group of permutations, it is shown that generators for the subgroups in a composition series can be found in polynomial time. The procedure also yields permutation representations of the composition factors. 1) Research supported by National Science Foundation Grants DCR-8403745 and DCR-8609491
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00275-2